Joint Chance Constrained Programming for Hydro Reservoir Management

نویسندگان

  • W. van Ackooij
  • R. Henrion
  • A. Möller
  • R. Zorgati
  • Wim van Ackooij
چکیده

In this paper, we deal with a hydraulic reservoir optimization problem with uncertainty on inflows in a joint chance constrained programming setting. In particular, we will consider inflows with a persistency effect, following a causal time series model, and examine the impact of the ”Gaussian” assumption for such inflows. We present an iterative algorithm for solving similarly structured joint chance constrained programming problems that requires a Slater point and the computation of gradients. Several alternatives to the joint chance constraint problem are presented. In particular, we present an individual chance constraint problem and a robust model. We illustrate the interest of joint chance constrained programming by comparing results obtained on a realistic hydro-valley with those obtained from the alternative models. Despite the fact that the alternative models often require less hypothesis on the law of the inflows, we show that they yield conservative and costly solutions. The simpler models, such as the individual chance constraint one, are shown to yield insufficient robustness and are therefore not useful. We therefore conclude that Joint Chance Constrained programming appears as a technique offering a good trade-off between cost and robustness and can be tractable for complex realistic models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Chance Constrained Multiple Objective Goal Programming Model of Fuzzy QFD and FMEA: Model Development

There are varieties of QFD combination forms available that can help management to choose the right model for his/her types of problem. The proposed MOCC-QFD-FMEA model is a right model to include variety of objectives as well as the risk factors into the model of the problem. Due to the fact that the model also takes into consideration the concept of Fuzzy set, it further allows management...

متن کامل

A chance-constrained multi-objective model for final assembly scheduling in ATO systems with uncertain sub-assembly availability

A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...

متن کامل

Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems

Joint chance constrained problems give rise to many algorithmic challenges. Even in the convex case, i.e., when an appropriate transformation of the probabilistic constraint is a convex function, its cutting-plane linearization is just an approximation, produced by an oracle providing subgradient and function values that can only be evaluated inexactly. As a result, the cutting-plane model may ...

متن کامل

CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...

متن کامل

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010